Chains in weak order posets associated to involutions

نویسندگان

  • Mahir Bilen Can
  • Michael Joyce
  • Benjamin Wyser
چکیده

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order posets of three different sets of involutions in the symmetric group, namely, the set of all involutions, the set of all fixed point free involutions, and the set of all involutions with signed fixed points (or “clans”). These distinguished sets of involutions parameterize Borel orbits in the classical symmetric spaces associated to the general linear group. In particular, we give a complete characterization of the maximal chains of an arbitrary lower order ideal in any of these three posets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lexicographic shellability of partial involutions

In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographically shellable poset. We determine which subintervals of the Bruhat posets are Eulerian, and moreover, by studying certain embeddings of the symmetric groups and their involutions into rook matrices and partial involu...

متن کامل

Order dense injectivity of $S$-posets

‎‎‎In this paper‎, ‎the‎ notion of injectivity with respect to order dense embeddings in ‎‎the category of $S$-posets‎, ‎posets with a monotone action of a‎ pomonoid $S$ on them‎, ‎is studied‎. ‎We give a criterion‎, ‎like the Baer condition for injectivity of modules‎, ‎or Skornjakov criterion for injectivity of $S$-sets‎, ‎for the order dense injectivity‎. ‎Also‎, ‎we consider such injectivit...

متن کامل

Generalised Ramsey numbers and Bruhat order on involutions

This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. We determine, in particular, all generalised Ramsey numbe...

متن کامل

‘Strong’-‘Weak’ Precedence in Scheduling: Extended Order Implications

We examine computational complexity implications for scheduling problems with job precedence relations with respect to strong precedence versus weak precedence. We propose a consistent definition of strong precedence for chains, trees, and series parallel graphs. Using modular decomposition for partially ordered sets (posets), we restate and extend past complexity results for chains and trees a...

متن کامل

Various kinds of regular injectivity for $S$-posets

‎In this paper some properties of weak regular injectivity for $S$-posets‎, ‎where $S$ is a pomonoid‎, ‎are studied‎. ‎The behaviour‎ ‎of different kinds of weak regular injectivity with products‎, ‎coproducts and direct sums is considered‎. ‎Also‎, ‎some‎ ‎characterizations of pomonoids over which all $S$-posets are of‎ ‎some kind of weakly regular injective are obtained‎. ‎Further‎, ‎we‎ ‎giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 137  شماره 

صفحات  -

تاریخ انتشار 2016